optim load shed aggreg mine queri asql unifi engin sequenc pattern xml strong interest emerg sql extens sequenc pattern kleen closur express burst interest research commun commerci world due databas data stream applic made extens includ financi servic rfid base inventori manag electron health system demo present sql system repres major step forward area sql support express languag gener kleen closur queri achiev express power nest word model greatli expand applic domain includ xml queri softwar trace analysi genom demo introduc core featur languag express complex pattern queri relat xml data overview architectur unifi engin user friendli interfac present sql queri stock market xml softwar trace analysi genom applic scalabl architectur queri optim fortransact dtime db evolv schema regular express nest word unifi languag queri execut relat xml sequenc grow interest queri languag extens pattern match event stream store databas sequenc due import applic extens make push extens led dbm vendor dsm ventur compani propos kleen closur extens sql standard build semin research demonstr effect amen effici implement construct extens power suffer limit sever impair effect real world applic overcom problem design sql languag system base investig nest word recent model gener word tree sql extend exist relat sequenc languag enabl applic domain genom softwar analysi xml process time sql remain extrem effici power optim pattern search nest word show sequenc languag xpath automat translat sql allow sql high perform queri execut back end languag sql unifi sql base engin sequenc xml queri optim techniqu updat rewrit integr constraint mainten schema evolut support system prism mit usa work databas cloud comput collabor prof sam madden mit autom databas schema evolut inform system upgrad complex cost time creat databas schema evolut process sourc incess problem life inform system major stumbl block prevent grace upgrad studi show problem encount tradit inform system exacerb web inform system cooper scientif databas frequenc schema increas toler downtim disappear prism project seek develop method tool turn error prone time consum process control predict avoid time goal assembl larg testb schema evolut histori develop languag schema modif oper smo express concis histori languag databas administr schema reli prism predict effect current applic ii translat queri updat work schema version iii perform data migrat iv gener full document interven prism achiev good usabl scalabl incorpor recent advanc map composit invert implement ii progress autom schema evolut achiev enabl technolog advanc light weight databas design methodolog embrac regular state softwar topic remain larg unexplor provid rich opportun futur research import area investig archiv inform system prism queri map techniqu support flashback histor queri databas archiv schema evolut prism workwench databas schema evolut tear mit usa work databas cloud comput collabor prof sam madden mit optim sampl slide window slide window model import case stream model recent element remain activ rest discard stream slide window model import applic babcock babu datar motwani widom pod datar gioni indyk motwani soda equal import type slide window model window fix size item arriv time recent item remain activ fix paramet bursti window item arriv burst singl step item step remain activ fix paramet random sampl fundament tool data stream numer algorithm oper sampl data entir stream effect sampl slide window nontrivi problem element eventu expir fact delet implicit identifi delet element store entir window implicit natur delet slide window exist method support explicit delet cormod muthukrishnan rozenbaum vldb frahl indyk sohler socg directli translat slide window model trivial approach overcom problem implicit delet sampl sampl requir sampl method maintain gt sampl hope sampl expir obviou disadvantag method twofold introduc addit cost decreas prima archiv queri histor data evolv schema mit usa work databas cloud comput collabor prof sam madden mit event dorient data model tempor queri transact dtime databas abstract past research tempor databas primarili focus state base represent relat queri languag extens represent led propos succe make signific impact sql compliant dbm recent signific interest progress event sequenc lead vendor propos extens sql standard pattern queri base kleen closur express paper outlin extens deal sequenc event show effect express tradit tempor queri coalesc join state base represent propos approach take full advantag fact state base represent dual represent base start event end event window window system version standard window system linux unix system design state art time incept network transpar window system client applic run machin network server run displai signific extens histori opengl support design lai fallow increas interest open sourc system longer suffici modern applic signific overhaul underwai paper describ revis architectur window system grow fraction desktop embed system publish naiv bayesian classifi privaci accuraci loss address problem publish na ve bayesian classifi nbc equival publish view build nbc protect privaci individu provid train data approach complet preserv accuraci origin classifi significantli improv current approach random anonym typic degrad accuraci preserv privaci current queri view secur checker address question view safe publish complet tackl question make view safe publish propos linear time algorithm publish safe nbcenabl view show simpl measur restrict ratio publish nbc statist suffici prevent breach privaci propos linear time algorithm enforc measur produc perturb statist assur individu privaci ii classifi behav nbc train origin data carefulli express deriv statist ration number easili produc synthet sanit dataset dataset produc dataset secur publish uniform prior achiev classif accuraci final extend result provid suffici condit cope arbitrari uniform prior distribut valid effect practic experi real world data computation expens time versu standard tale tempor databas manag histori metadata support db archiv schema evolut abstract modern inform system web inform system face frequent databas schema gener necess manag preserv schema evolut histori paper describ panta rhei framework design provid power tool facilit schema evolut guid databas administr plan evalu ii support automat rewrit legaci queri current schema version iii enabl effici archiv histori data metadata iv support complex tempor queri histori introduc histor metadata manag hmm tool design facilit process document queri schema evolut schema histori wikipedia databas tell benefit hmm verifi mine frequent pattern larg window data stream abstract mine frequent itemset data stream prove difficult comput complex real time respons paper introduc verif algorithm improv perform monitor mine task associ rule propos frequent itemset mine method slide window faster state art method fact run time constant respect window size entail mine larger window perform frequent itemset mine method includ static data improv likewis replac count method hash tree verif algorithm verifi mine frequent pattern larg window data stream abstract mine frequent itemset data stream prove difficult comput complex real time respons paper introduc verif algorithm improv perform monitor mine task associ rule propos frequent itemset mine method slide window faster state art method fact run time constant respect window size entail mine larger window perform frequent itemset mine method includ static data improv likewis replac count method hash tree verif algorithm minim latenc memori dsm unifi approach quasi doptim schedul data stream manag system dsmss support optim execut schedul multipl continu queri massiv frequent bursti data stream previou approach optim memori consumpt respons time latenc produc algorithm paper extend popular chart partit procedur previous memori optim simpl oper path minim latenc memori complex queri graph tupl share fork test perform algorithm assum knowledg averag behavior tupl oper theoret assum detail knowledg behavior individu tupl experi show practic algorithm close approxim perform optim categori subject descriptor databas manag system queri process design induct data stream manag system stream mill experi recent interest line data mine exist mine algorithm design store data applic effect data stream real time respons need data characterist chang frequent research focus design improv algorithm line mine task classif cluster frequent itemset mine pattern match attent paid design dsmss facilit integr task mine data stream stream system provid induct function analog provid weka ms ol db store data paper propos notion induct dsm system provid rich librari inter oper function support mine process support essenti dsm includ optim continu queri load shed synopt construct stop comput eas extens addit desiderata propos induct dsm review challeng involv realiz system present approach extend stream mill dsm goal system featur power queri languag mine method express aggreg gener stream arbitrari window ii librari fast light mine algorithm iii architectur make easi custom extend exist mine method introduc tempor queri version manag xml dbase document archiv time dstamp manag queri execut data stream manag system improv accuraci continu aggreg mine queri data stream load shed improv accuraci continu aggreg mine queri data stream load shed grace databas schema evolut prism workbench support grace schema evolut repres unsolv problem tradit inform system exacerb web inform system wikipedia public scientif databas project base multiparti cooper frequenc databas schema increas toler downtim disappear todai schema evolut remain error prone time consum undertak db administr dba lack method tool need manag autom endeavor predict evalu effect propos schema ii rewrit queri applic oper schema iii migrat databas prism system take big step address press provid languag schema modif oper express concis complex schema ii tool dba evalu effect iii optim translat queri work schema version iv automat data migrat full document interven need support data proven databas flash back histor queri prism solv problem integr recent theoret advanc map composit invert design achiev usabl scalabl wikipedia schema version provid invalu testb valid prism tool abil support legaci queri manag queri transact dtime databas schema evolut problem manag histori databas inform made urgent complex fast spread web inform system wikipedia prima system address difficult problem introduc kei piec technolog method publish histori relat databas xml evolut schema underli databas unifi represent tempor group represent make easi formul sophist histor queri schema version standard xqueri kei piec technolog schema evolut transpar user write queri current schema retriev data schema version system perform labor intens error prone task rewrit queri equival version schema featur import histor queri span potenti hundr schema version realiz prima introduc schema modif oper smo repres map success schema version ii xml integr constraint languag xic effici rewrit queri constraint establish smo scalabl approach test synthet data real world data wikipedia db schema evolut histori xml version detect rfid data process data stream queri languag optim timestamp manag data stream manag system flexibl queri graph base model effici execut continu queri load shed window join multipl data stream load shed classifi multi dsourc stream data bay risk approach monitor multipl stream sourc collect decis make present challeng stream data larg volum fast speed highli bursti natur imposs offload classif decis individu data sourc lack full knowledg decis make central classifi respons decis make frequent overload paper studi intellig load shed classifi multi sourc data aim maxim classif qualiti resourc cpu bandwidth constraint markov model predict distribut featur valu time leverag bayesian decis theori bay risk analysi model varianc data sourc contribut classif qualiti adopt expect observ risk criterion quantifi loss classif qualiti due load shed propos featur bff algorithm greedili minim risk effect approach propos confirm experi manag xml version replica context data stream languag system design power extens succinct sampl stream data stream languag system design power extens effici tempor coalesc queri support relat databas system abstract interest user demand tempor databas increas time dbm vendor standard group move aggress extend system support transact time valid time partial attribut expect major amp cost add tempor support rdbm directli extend databas engin newli introduc sql standard significantli enhanc abil support tempor applic commerci databas system long recogn problem coalesc difficult support framework sql effect support rdbm paper investig altern tempor coalesc queri tempor data model rdbm provid sql base queri algorithm nativ relat user defin aggreg uda approach approach requir singl scan databas conclud tempor queri support olap function support current sql standard find demonstr current rdbmss matur directli support effici tempor queri provid paradigm tempor databas research implement xml build effici transact dtime tempor databas system relat databas unifi process xml stream relat data stream relat data stream xml stream previous provid separ research foci unifi support singl data stream manag system dsm desir applic viewpoint paper propos simpl approach extend relat dsmss support kind stream effici stream mill system xml stream express sax event easili transform relat stream vice versa enabl close cooper queri languag result great power flexibl instanc xqueri call function defin sqlbase express stream languag esl logic physic window prove relat data stream benefit gain system level relat dsm techniqu load shed memori manag queri schedul approxim queri answer synopsi mainten appli xml stream fsa base optim techniqu develop xpath xqueri easili effici incorpor system show yfilter capabl effici process multipl complex xml queri easili integr stream mill esl user defin systemdefin aggreg approach produc power flexibl system relat xml stream unifi process effici bridg relat databas histori web xml approach support complex queri multivers xml document manag multipl version xml document repres critic requir applic recent work support complex queri xml data regular path express structur project paper examin problem implement effici complex queri multivers xml document approach reli number scheme durabl node number dnn preserv order node xml tree remain invari respect updat document dnn show complex queri reduc combin rang version retriev queri examin altern storag organ index scheme effici evalu rang version retriev queri environ perform analysi present reveal advantag scheme data clean belief propag mine databas data stream queri languag rule abstract data intens applic reach tradit data base manag system dbm data mine stand practic import complex research problem solv vision induct dbm realiti paper discuss technic develop occur notion induct dbm emerg result semin paper author imielinski mannila decad ago research progress achiev subdivid main problem subarea languag ii optim iii represent discuss problem area approach induct dbm made recent technic advanc pursu languagecentr solut introduc simpl sql extens proven effect support data mine final turn attent relat problem support data stream mine data stream manag system dsm introduc notion induct dsm addit continu queri languag dsm provid support synops sampl load shed built function need data stream mine show induct dsm achiev gener dsm assur continu queri languag support effici data stream mine applic dsm extend induct capabl provid uniqu support environ data stream mine applic improv mine qualiti exploit data depend adapt nearest neighbor classif algorithm data stream abstract paper propos increment classif algorithm multi resolut data represent find adapt nearest neighbor test point algorithm achiev excel perform small classifi ensembl approxim error bound guarante ensembl size low updat cost increment classifi make highli suitabl data stream applic test perform synthet real life data classifi outperform exist algorithm data stream term accuraci comput cost version manag histor queri digit librari nativ extens sql mine data stream version manag histor queri digit librari tempor xml sql strike back introduct tempor extens databas standard proven difficult achiev newli introduc sql xml xqueri standard enhanc abil support tempor applic commerci databas system illustr point discuss approach tempor group represent compar approach logic level common set queri turn physic level discuss archi system support approach effici unifi physic implement conclud approach manag transact time inform xml sql integr support effici current standard claim propos approach extend valid time bitempor databas xml dbase approach publish queri histori databas current interest publish view databas xml document gener benefit approach follow popular xml tool set visual process inform encod univers standard paper explor addit uniqu benefit achiev approach tempor databas applic show xml xqueri provid surprisingli ectiv solut problem support histor queri past content databas relat evolut xml histori databas relat natur repres tempor group data model identifi map relat xml conduc model queri databas histori show tempor queri di cult express sql easili express standard xqueri approach gener store version histori arbitrari document relat databas support queri evolut schema mine noisi data stream discrimin model xbit xml dbase bitempor data model past research work model manag tempor inform fail elicit support commerci databas system increas popular xml xqueri offer uniqu opportun chang situat support tempor inform relat tabl sql import conclus claim paper show valid time transact time bitempor databas natur view xml tempor group data model show complex histor queri di cult express sql relat tabl easili express standard xqueri xml base represent discuss manag transact time valid time histori extend approach bitempor histori approach gener natur support tempor manag arbitrari xml document queri version histori tempor inform manag xml adapt learn approach noisi data stream critic challeng typic mine data stream concept drift data contamin address challeng seek learn techniqu model robust nois adapt time fashion approach stream mine problem statist estim framework propos fast robust discrimin model learn noisi data stream build ensembl classifi achiev time adapt weight classifi maxim likelihood data emploi robust statist techniqu allevi problem nois sensit experiment result synthet real life data set demonstr effect model learn approach fast light boost adapt mine data stream support continu mine queri data stream requir algorithm fast ii make light demand memori resourc iii easili adapt concept drift propos boost ensembl method achiev object techniqu base dynam sampl weight assign scheme achiev accuraci tradit boost requir multipl pass data techniqu assur faster learn competit accuraci simpler base model scheme extend handl concept drift chang detect chang detect approach aim signific data deterior ensembl perform replac obsolet ensembl built scratch experiment result confirm advantag adapt boost scheme previou approach queri languag data model databas sequenc data stream studi fundament limit relat algebra ra sql support sequenc stream queri present effect queri languag data model enrich deal begin observ limit sql applic domain import data stream sequenc queri data mine present formal proof continu queri data stream sql su er addit express power problem begin focus notion nonblock nb queri continu queri support data stream character notion nonblock queri show equival monoton queri notion ra formal abil express monoton queri express ra monoton oper ra show ra nb complet sql power ra monoton queri express optim sequenc queri databas system paper investig design optim queri languag capabl express support effici search complex sequenti pattern databas system introduc sql ts extens sql express pattern studi optim queri languag optim text search algorithm knuth morri pratt gener handl complex queri sequenc algorithm exploit interdepend element pattern minim repeat pass data experiment result typic sequenc queri doubl bottom queri confirm substanti speedup achiev optim techniqu atla nativ extens sql data mine design implement tempor extens sql atla nativ extens sql data mine incomplet databas languag data stream data mine problem cure repres queri evolut databas schema xml show xml view combin xml queri languag provid surprisingli effect solut problem repres queri evolut databas evolut content evolut schema xml histori databas relat repres natur mean tempor group data model show schema tabl histori difficult repres relat databas easili repres xml queri xqueri tempor queri xml document archiv web warehous store success version document increment fashion xml repositori data warehous achiev effici preserv critic inform ii abil support histor queri evolut document content paper present effici techniqu manag multivers document histori support power tempor queri document approach consist concis repres success version document xml document implement tempor group data model ii xml queri languag xqueri express complex queri content version tempor evolut document element content show data definit amp manipul framework xml amp xqueri support tempor model histor queri significantli tradit framework relat tabl amp sql demonstr point investig express complex queri histori relat tabl publish xml data atla small complet sql extens data mine data stream introduct dbmss long suffer sql lack power extens implement atla power databas languag system enabl user develop complet data intens applic sql write aggreg tabl function sql procedur languag current object relat system result atla sql ture complet suitabl advanc data intens applic data mine stream queri atla system download suit applic includ data mine function code atla sql execut modest perform overhead respect applic written propos demo illustr kei featur applic atla demonstr atla sql featur includ nativ support user defin aggreg tabl functi publish queri histori archiv relat databas xml current interest publish view databas xml document gener benefit approach follow popular xml tool set visual process inform encod univers standard paper explor addit uniqu benefit achiev approach tempor databas applic show xml view combin xqueri provid surprisingli effect solut problem support histor queri past content databas relat evolut xml histori databas relat natur repres tempor group data model identifi map relat xml conduc model queri databas histori show tempor queri difficult express sql easili express standard xqueri greedi algorithm datalog design algorithm greedi paradigm power tool deduct databas approach plan paper show classic plan problem model simpl databas construct logic base semant approach similar model updat nondeterm activ databas rule begin express plan mean datalog program nondeterminist choic construct provid formal semant concept stabl model result program character syntact structur xy stratif make amen effici implement compil fixpoint comput techniqu develop deduct databas system deduct databas system ldl paper describ system research advanc enabl design develop begin discuss nonmonoton nondeterminist construct extend function languag preserv model theoret fixpoint semant describ execut model open architectur design support construct facilit integr exist dbmss applic final describ lesson learn test applic middlewar datamin kei constraint monoton aggreg deduct databas extend xpoint model theoret semant logic program lude uniqu kei cfi straint deriv relat extens reas express power datalog program preserv dec rfim semant and implement greater express power yield simplec harac eriz notion set aggreg lude ident ion aggreg monoton respec setc ontain andc inrec iv logic program cfi struc ts arec ritic applic ion produc simpl logic base formul cfi plex algorithm previous believ realm decr vv ivelog extend sql decis support applic effici complex queri support multivers xml document manag multipl version xml document repres critic requir applic recent interest support complex queri xml data regular path express structur project diff queri paper examin problem support effici complex queri multivers xml document approach reli scheme base durabl node number dnn preserv order xml tree node invari respect updat document dnn complex queri reduc combin partial versio retriev queri examin index scheme effici evalu partial version retriev queri environ perform analysi present reveal advantag scheme preserv queri histori xml dpublish relat databas current interest publish view databas resid data xml document fact xml view databas easili visual web browser process web languag includ power queri languag xqueri databas updat extern xml view evolv paper investig problem repres evolut histori view xml document complet histori databas visual web browser process web languag queri power queri languag xqueri investig approach publish relat data identifi select repres queri databas histori show select represent make easi formul xqueri tempor queri difficult express sql databas relat final discuss briefli storag organ support queri effici atla system power databas languag base simpl extens sql effici structur join index xml document queri xml document typic combin select element content path express structur relationship tag element structur join find pair element satisfi primit structur relationship queri parent child ancestor descend relationship effici support structur join kei effici implement xml queri recent propos node number scheme enabl captur xml document structur ing tradit indic tree tree paper propos effici struc tural join algorithm presenc tag indic concentr tree show expedit structur join avoid collect element particip join intro duce enhanc base sibl pointer improv perform sibl pointer easili implement dynam maintain present structur join algorithm util tree deduct databas system ldl paper describ system research advanc enabl design develop begin discuss nonmonoton nondeterminist construct extend function languag preserv model theoret fixpoint semant describ execut model open architectur design support construct facilit integr exist dbmss applic final describ lesson learn test applic middlewar datamin push extrema aggreg optim logic queri paper explor possibl transform queri minimum maximum predic equival queri comput effici effici scheme manag multiversionxml document multivers support xml document need critic applic softwar configur control cooper author web inform warehous perman web document paper introduc cient robust techniqu store retriev ii view exchang iii queri multivers xml document discuss limit tradit version control method rc scc propos techniqu overcom limit initi focu problem manag secondari storag cientli introduc edit base version scheme enhanc rc ectiv cluster polici base concept page us scheme drastic improv version retriev expens small linear space overhead edit base approach fall short achiev object ii iii introduc investig scheme refer base preserv structur origin document refer base approach multivers document repres xml document easili exchang view web simpl queri express support represent optim sequenc queri databas system copi dbase versu edit dbase version manag scheme structur document manag multipl version xml document semistructur data repres problem grow interest tradit version control method rc edit script repres document support increment reconstruct version edit base approach recent enhanc replic scheme call ubcc ubcc base notion page us ensur effect manag multi version document term retriev storag cost improv notwithstand edit base represent suffer limit gener flexibl repres rearrang document duplic part content solv problem paper propos copi base ubcc version scheme simpler format electron exchang multi version document object match perform edit base ubcc techniqu develop algorithm enhanc copi base ubcc scheme page us manag present result experi test storag retriev perform copi base approach compar edit base ubcc approach effici manag multivers document object referenc tradit approach version semistructur inform edit base subsequ document version repres edit script paper propos refer base version manag scheme preserv logic structur evolv document object refer preserv document structur version scheme facilit effici queri support examin queri involv project select document version queri document evolut histori show propos scheme effect represent multivers xml document transport exchang level fact refer base scheme document histori view process xml document demonstr effect scheme storag level scheme enhanc us base page manag polici extend adapt techniqu transact time databas ensur effici cluster inform version extens comparison refer base version represent tempor databas persist object manag depict perform advantag approach final note refer base version applic kind semistructur inform xml document replac tradit version control scheme edit base rc timestamp base scc sequenti pattern queri languag support instant data mine dservic store queri multivers xml document durabl node number manag multipl version xml document repres import problem tradit applic softwar configur control link perman web document research manag multivers xml document seek provid effici robust techniqu store retriev queri document paper present approach version manag achiev object scheme base durabl node number timestamp element xml document present effici storag retriev techniqu multivers document explor index cluster strategi need assur effici support complex queri content document evolut store queri multivers xml document durabl node number manag multipl version xml document repres import problem tradit applic softwar configur control link perman web document research manag multivers xml document seek provid effici robust techniqu store retriev queri document paper present approach version manag achiev object scheme base durabl node number timestamp element xml document present effici storag retriev techniqu multivers document explor index cluster strategi need assur effici support complex queri content document evolut extend stratifi datalog captur complex class rang qh paper present unifi solut problem extend stratifi datalog express databas complex class rang qh qh queri hierarchi decis problem solv polynomi time determinist ture machin constant number call oracl solut base stratifi negat core simpl declar semant negat ii choic construct captur nondetermin stabl model disciplin fashion iii abil bind queri lowest complex level includ problem hand iv gener algorithm adapt behavior desir level complex requir queri exponenti time comput requir hard problem semant express power nondeterminist construct deduct databas xml document version greedi algorithm datalog design algorithm greedi paradigm power tool advanc databas technolog edbt databas system extens decis support axl approach sqlst spatio dtempor data model queri languag paper propos queri languag data model spatio tempor inform includ object time chang geometri user defin aggreg object drelat system user defin aggreg essenti advanc databas applic express data mine function find support current system includ object relat databas limit current system inabl introduc aggreg code procedur languag origin propos sql ii inabl return partial result comput support onlin aggreg iii inabl aggreg recurs queri express bill materi optim graph search paper present unifi solut problem realiz sql origin propos user defin aggreg uda add signific improv term express power eas fact sql ag system support onlin aggreg monoton aggreg high level aggreg definit languag name sadl focu cmp fast decis tree classifi multivari predict decis tree classifi design class histogram singl attribut select attribut split histogram paper propos techniqu keep histogram attribut pair achiev signific speed tradit classifi base singl attribut split ii abil build classifi linear combin valu categor attribut pair split criterion keep dimension histogram cmp predict success split addit comput current cmp grow level decis tree data scan cmp perform improv due techniqu categor attribut discret loss classif accuraci fact introduc simpl techniqu classif error caus discret step correct step summari cmp repres unifi algorithm extend function exist classifi improv perform sql build aggreg extend object relat system user defin aggreg uda provid versatil mechan extend power applic object relat databas db paper describ axl system support sqlbase languag introduc uda axl easi learn databas programm preserv construct program paradigm data type sql imped mismatch sql procedur languag user defin function db axl inherit benefit databas queri languag scalabl data independ paralleliz paper show ad minim extens sql axl power capabl express complex algorithm cientli demonstr code data mine function advanc applic previous major problem sql databas due flexibl sql compati version manag xml document problem ensur effici storag fast retriev multi version structur document import recent popular xml document semistructur inform web tradit document version control system rc model document sequenc line text shortest edit script repres version differ ineffici preserv logic structur origin document propos approach structur document preserv intact object timestamp hierarch effici reconstruct current past version techniqu call us base copi control ubcc gear effici version reconstruct small storag overhead analysi experi illustr effect approach version control structur document ubcc easili support multipl concurr version partial document retriev version manag xml document problem ensur effici storag fast retriev multi version structur document import recent popular xml document semistructur inform web tradit document version control system rc model document sequenc line text shortest edit script repres version differ ineffici preserv logic structur origin document propos approach structur document preserv intact object timestamp hierarch effici reconstruct current past version techniqu call us base copi control ubcc gear effici version reconstruct small storag overhead analysi experi illustr effect approach version control structur document ubcc easili support multipl concurr version partial document retriev user ddefin aggreg datamin user defin aggreg linchpin sophist datamin function advanc databas applic demonstr effici implement db sql user defin aggreg extend earli return implement data mine algorithm aggreg earli return monoton freeli recurs queri introduct import rollup data cube decis support univers recogn aggreg sine qua built in releas commerci dbmss claim research vendor overlook userdefin aggreg uda plai critic pervas role databas centric data mine applic show ffl data mine algorithm reli special aggreg ffl number divers aggreg impli vendor ad ad hoc builtin user ddefin aggreg databas languag user defin aggreg linchpin sophist datamin function advanc databas applic find support current databas system includ object relat databas limit current databas inabl introduc aggreg code procedur languag propos sql ii inabl return partial result comput support onlin aggreg iii inabl aggreg recurs queri express bill materi bom applic optim graph search paper propos unifi solut problem discuss practic theoret aspect power addit databas languag introduct import special aggreg advanc applic exemplifi rollup data cube ow decis support applic sine user ddefin aggreg databas languag user defin aggreg linchpin sophist datamin function advanc databas applic find support current databas system includ object relat databas limit current databas inabl introduc aggreg code procedur languag propos sql ii inabl return partial result comput support onlin aggreg iii inabl aggreg recurs queri express bill materi bom applic optim graph search paper propos unifi solut problem discuss practic theoret aspect power addit databas languag introduct import special aggreg advanc applic exemplifi rollup data cube ow decis support applic sine univers tempor extens databas languag tempor reason tempor queri languag present difficult research problem theoret interest practic import problem chasm point base tempor reason intervalbas reason problem lack robust univers propos solut tempor extens design languag easili appli queri languag extens propos sql appli qbe datalog paper provid simpl solut problem observ queri languag support singl base reason ii aggreg base reason show modal natur extend support point base interv base tempor queri follow tsql practic requir concern show function captur simpler construct appli uniformli datalog qbe sq grammar automata optim chain logic queri critic problem find effici implement recurs queri bound argument offer open challeng practic theoret import method effect gener case linear program special case left recurs linear program paper propos approach solv problem chain queri queri bind propag argument head argument tail rule chain fashion method call pushdown method base fact chain queri context free languag pushdown automaton recogn languag emul rewrit queri factor left linear program propos method gener unifi previou techniqu count left mix linear method succe reduc linear program queri equival linear univers tempor data languag tempor reason tempor queri languag present difficult research challeng slowli yield combin attack investig motiv theoret interest practic import problem paper subscrib tsql practic requir queri languag concern propos solut overcom shortcom lack univers tsql tempor extens easili appli queri languag qbe datalog paper datalog framework develop languag tempor data languag tdl support claim univers argu tdl construct semant directli appli deriv tempor extens languag qbe sql final evalu altern approach implement tdl basi implement ldl system extend aggreg develop ucla user defin aggreg logic data languag wave data intens knowledg base applic data mine decis support requir introduct complex applic specif aggreg function paper propos extens deduct databas system support applic develop construct formal semant implement techniqu user defin aggreg describ realiz extend ldl system recent built ucla extens system support onlin aggreg roll up data cube tempor aggreg time seri iceberg queri recent propos oper decis support data mine procedur discuss applic technolog dbmss sql specif support notion user defin aggreg show sql suffer limit sever restrict applic propos simpl extensio greedi algorithm datalog choic negat design algorithm greedi paradigm power tool solv effici classic comput problem framework procedur languag express algorithm declar framework logic base languag proven difficult research challeng paper extend framework datalog languag obtain simpl declar formul problem propos effect implement techniqu ensur comput complex compar procedur formul advanc achiev choic construct extend prefer annot effect select altern stabl model nondeterminist fixpoint show suitabl storag structur differenti fixpoint comput program match complex procedur algorithm classic search optim problem introduct problem findin advanc databas system monet customiz databas system develop cwi univers amsterdam intend databas backend wide vari applic domain design maximum databas perform todai workstat multiprocessor system achiev consider success support data mine applic work project high end gi applic monet type algebra extens databas system emploi share memori parallel paper give goal motiv monet outlin architectur featur includ decompos storag model dsm emphasi bulk oper main virtual memori server custom case discuss issu build gi top monet monet handl larg data volum involv part work support sion grant nonmonoton semant activ rule deduct databas provid logic base semant activ databas rule immedi tupl level activ polici sql result character analyz behavior complex rule system declar framework stabl model lai theoret foundat desir integr activ databas deduct databas introduct deduct databas research long recogn struggl resolv relat problem area pertain formal semant logic orient rulebas system problem move stratifi negat preserv comput tractabl problem provid simpl declar semant updat activ rule fact progress front front introduct concept found model stabl model establish formal compreh tempor aggreg activ databas rule import featur advanc activ databas prototyp support rule trigger complex pattern event composit event languag provid power primit event base tempor reason fact import except express power match surpass sophist languag offer time seri manag system tsm extens tempor data analysi knowledg discoveri except pertain tempor aggreg current activ databas system offer minim support paper introduc languag trepl address problem trepl prototyp develop ucla offer primit tempor aggreg exce capabl state art composit event languag compar tsm languag trepl demonstr rigor gener approach definit composit event languag sema logic total partial order plan deduct databas approach paper show complex plan strategi find natur logic base formul effici implement framework deduct databas languag begin model classic strip total order plan mean datalog program show program stabl model semant amen effici comput show propos approach express flexibl model partial order plan abstract plan plan stand class total order plan result reduct search space subsequ improv effici introduct program ddetermin deduct databas paper overview recent result topic aim provid introduct theori practic determin deduct databas recal main result link determinist construct databas languag theori data complex express hierarchi queri languag ii provid reason introduct effect program nondeterminist construct iii compar usag determinist construct languag determinist ddeterminist stabl model stabl model introduc domain total interpret stabl model exist multipl stabl model program power mechan express determin stabl model extend domain partial interpret stabl model paper show presenc multipl stabl model direct manifest determin express assort degre undefined separ factor determin undefined paper introduc notion determinist stabl model strictli determinist determinist stabl model form interest famili lattic structur found model serv bottom top lattic maximum determinist stabl model resolv differ stabl model famili hand model fam formal semant composit tempor event activ databas rule major thrust current research activ databas allow complex pattern tempor event serv precondit rule trigger common formal semant composit event specif languag system assort approach includ finit state machin petri net petri net paper propos unifi approach base syntax direct translat composit event express datalog formal semant defin mean origin event express logic databas logic databas long advent relat databas basic queri languag relat databas relat algebra tupl calculu domain calculu subset order predic logic logic prove adequ establish sound theori relat databas attempt made integr ai databas technolog form expert databas system knowledg base manag system logic provid unifi framework differ logic field discov confluenc logic program databas trigger deduct databas area research overview paper discuss shortli relationship relat databas logic present possibl coupl prolog databas main part paper concentr deduct databas databas languag datalog conclud mention facet recent research logic databas goal paper provid overview relev develop field provid pointer literatur deduct databas challeng relat stabl model ai plan domain paper show simpl connect logic program plan main result paper plan domain consist initi state set oper definit domain translat linear time logic program goal achiev plan domain iff relat goal true stabl model logic program obtain translat show translat yield interest consequ method updat databas handl surpris execut plan surpris occur initi plan partli execut result intermedi state differ due extern reason predict rigid action action execut pre condit true easili accommod framework introduct fundament metaqueri data mine chapter present framework metaqueri integr induct learn method deduct databas technolog context knowledg discoveri databas metaqueri order predic templat guid deduct data collect focus attent induct learn assist human analyst discoveri loop describ detail system idea unifi bayesian data cluster logic data languag ldl show result case studi discov regular knowledg base discov pattern error larg telecommun databas discov pattern error larg chemic databas pattern discov metaqueri implic rule probabl rule link inform tabl databas store persist multipl purpos includ error detect polynomi dtime comput stabl model composit tempor event activ databas rule logic dorient approach activ databas rule transact dconsciou stabl dmodel semant semant repres major problem area activ databas formal framework defin implementationindepend semant activ rule ii system develop ad hoc oper semant wide situat contribut difficulti predict run time behavior set rule ensur termin set rule view major research issu paper introduc durabl chang semant activ databas rule semant improv starburst defer activ notion concept postgr heraclitu semant foundat deduct databas provid formal logic base model transact orient semant show amen effici implement prove solv termin problem introduct activ databas languag system hav pushdown method optim chain logic program extend abstract critic problem find effici implement recurs queri bound argument offer open challeng practic theoret import propos approach solv problem chain queri queri bind propag argument head argument tail rule chain fashion method call pushdown base fact chain queri context free languag pushdown automaton recogn languag emul rewrit queri factor left linear program propos method gener unifi previou techniqu count left mix linear method succe reduc linear program queri equival linear datalog queri stratifi negat choic dp relat stabl model ai plan domain paper show simpl connect logic program plan main result paper plan domain consist initi state set oper definit domain translat linear time logic program goal achiev plan domain iff relat goal true stabl model logic program obtain translat show translat yield interest consequ method updat databas handl surpris execut plan surpris occur initi plan partli execut result intermedi state differ due extern reason predict rigid action action execut pre condit true easili accommod framework introduct fundament intellig knowledg discoveri assist internet abstract dynam activ databas rule model refin semant repres major problem area activ databas formal framework defin abstract semant activ rule ii system develop ad hoc oper semant wide situat contribut difficulti predict run time behavior set rule ensur termin set rule recogn major research issu situat hamper applic power technolog critic applic area composit tempor event activ databas formal semant activ databas support rule trigger complex pattern composit tempor event paper propos gener method semant composit event specif languag method base syntax direct translat composit event express datalo formal semant defin mean origin event express show method applic languag aq od snoop samo ba formal finit state machin graph petri net propos method overcom problem limit affect formal extrema predic deduct databas approach propos express comput effici larg class problem includ find shortest path vldb ion pattern proceed twentieth intern confer larg databas page santiago chile materi abstract pattern identifi applic set intuit materi relationship class categori model car class concret object individu car talk precis semant definit materi term usual abstract class metaclass correspond power inherit mechan materi exampl properti extens materi present provid materi abstract mechan conceptu model enhanc express control introduct classif applic level integr dispar inform system document data qualiti assess assur effici execut recurs queri control bind propag metagueri integr induct learn deduct databas technolog simpl model activ rule behavior deduct databas recent advanc monoton semant deduct databas provid simpl framework model condit action rule activ databas approach unifi semant activ deduct databas yield benefit express power ddeterminist oper logic dbase languag determinist oper need order relat languag datalog extend express power languag support effici formul low complex problem paper studi oper propos literatur includ wit lazi choic dynam choic compar power express determinist determinist queri obtain simpl hierarchi relat oper construct negat fixpoint unif activ databas deduct databas rule orient paradigm databas focu extens research come ag commerci dbm world negat aggreg recurs rule ldl approach problem allow monoton construct negat aggreg recurs program repres difficult challeng face current research deduct databas paper present solut combin gener effici demonstr implement ldl system gener treatment set aggreg allow user defin aggreg present introduct area monoton reason benefit significantli research deduct databas demonstr introduct concept stratifi negat stratifi set aggreg concept signific remov limit problem prolog negationbi failur conduc effici implement demonstr system glue nail ldl coral experi gain real life applic clear stratif dynam program optim logic queri aggreg polynomin time comput stabl model unifi semant activ deduct databas rule orient paradigm databas focu extens research come ag commerci dbm world system develop support paradigm limit effect system applic requir complet integr kind rule paper discuss technic problem make integr difficult trace root lack unifi underli semant review recent advanc semant monoton logic show unifi foundat activ databas deduct databas final outlin design rule languag databas integr deduct system trigger base dbm introduct rule provid main paradigm express comput activ databas deduct databas unif paradigm repres research problem ldl spatio dtempor reason atmospher scienc databas optim linear logic program count method stochast logic program slp shown generalis hidden markov model hmm stochast context free grammar direct bay net stochast logic program consist set label claus interv order rang restrict definit claus paper summaris syntax distribut semant proof techniqu slp discuss standard induct logic program ilp system progol modifi support learn slp result system find slp uniform probabl label definit maxim bay posterior probabl alter probabl label increas posterior probabl stage implement cprogol differ previou version progol allow user defin evalu function written prolog shown maximis bayesian posterior function involv user impress ldl coral improv data qualiti ldl ldl spatio dtempor reason atmospher scienc databas optim linear logic program count method stochast logic program slp shown generalis hidden markov model hmm stochast context free grammar direct bay net stochast logic program consist set label claus interv order rang restrict definit claus paper summaris syntax distribut semant proof techniqu slp discuss standard induct logic program ilp system progol modifi support learn slp result system find slp uniform probabl label definit maxim bay posterior probabl alter probabl label increas posterior probabl stage implement cprogol differ previou version progol allow user defin evalu function written prolog shown maximis bayesian posterior function involv logic program semant made easi propos model theoret semant logic program call pure semant base notion unfound set assumpt set pure semant emerg observ major iogic program semant featur common intend model set neg liter correspond greatest unfound set set posit liter word model redund inform neg part function posit part total model partial model program character set posit liter base idea develop pure semant logic program result remark simpl semant unifi previou approach explain partial model semant weaker close world assumpt greedi choic graph comput algorithm propos solut greedi paradigm algorithm design tool effici solv classic comput problem framework procedur languag difficult express algorithm declar framework logic base languag paper extend framework datalog languag provid simpl declar formul problem comput complex compar procedur formul achiev construct choic semant reduc neg program stabl model semant show formul greedi algorithm construct lead syntact class program call stage stratifi program easili recogn compil time fixpoint base implement recursiva pro gram effici combin suitabl storag structur yield asymptot complex compar obtain procedur languag intellig databas challeng opportun evolut exist inform system wave data intens applic creat strong demand databas center program environ sophist intellig support current databas system paper describ contribut deduct databas offer evolut databas inform system statisfi demand addit databas essenti deduct databas support rule base logic orient languag ters formul complet applic reason queri support rule base interfac elimin imped mismatch problem program languag queri sublanguag elev design develop databas applic level declar knowledg base specif paper review evolut enabl technolog architectur deduct databas prototyp compil set term logic data languag ldl ddetermin deduct databas paper examin problem ad determinist construct declar databas languag base horn claus logic revis previous propos approach choic construct introduc krishnamurthi naqvi viewpoint amen effici implement express power partial model dvalu model logic program negat properti lui moniz pereira anil nerod editor logic program monoton reason proceed intern workshop page lisbon mit press juli min jack minker indefinit databas close world assumpt proceed confer autom deduct york page springer min jack minker foundat deduct databas morgan kaufmann street lo alto ca st edit min jack minker perspect deduct databas journal logic program min jack minker foundat disjunct logic program ew lusk ross overbeek editor proceed north american confer logic program page mit press min jack minker overview nonmonoton reason logic program cs tr comput scienc dept univ maryland univers marylan effici process declar rule dbase languag datebas minimum maximum predic logic program approach propos ezpress comput effici larg class problem includ find shortest path graph previous consid impervi effici treatment declar framework logic base languag approach base rain max predic order semant defin rule negat bodi show cer tain monotonictri condit hold ezist totm found model program ing negat model comput efcient procedur call greedi flxpoint origin program rewritten effici push rain max predic recurs deduct databas theori meet practic deduct databas come ag emerg effici easi system support queri reason applic develop databas declar logic base languag build solid theoret foundat field ben efit recent year form dramat advanc enabl technolog progress demonstr complet prototyp system offer level gener formanc robust support complex applic develop valuabl emerg experi build system learn algorithm architectur build power deduct databas system begin understand program environ paradigm conduc applic area identifi system effect includ area domain tradit databas applic final design deploy deduct databas provid stimulu focu research fundament issu result theori field made signific progress topic semant extens horn logic algorithm compil optim declar program benefici interact theori practic remain strength deduct databas field enter ag technolog matur system analysi deduct databas environ enhanc role aggreg entiti deduct databas system applic program stabl model ddetermin logic program negat previou research propos gener horn claus logic support negat determin seper extens paper show stabl model semant logic program unifi basi treatment concept introduc concept partial model stabl modd strongli found model determinist model interest class partial model studi relationship show maxim determinist model program subset intersect stabl model found model program subset maxim determinist model show stabl model subsum determinist choic construct ldl altern definit semant construct final provid construct definit stabl model introduct procedur call backtrack fixpoint noneteterminisf construct total stabl model model exist ldl system prototyp ldl system declar logic base languag integr relat databas logic program technolog support advanc data knowledg base applic paper comprehens overview system descript ldl languag compil techniqu emploi translat ldl queri target queri store data paper descript architectur runtim environ system optim techniqu emploi order improv perform assur safeti compil queri paper conclud account experi gain system discuss applic area ldl approach appear effect deduct databas achiev futur direct recent year deduct databas focu intens research brought dramat advanc theori system applic salient featur deduct databas capabl support declar rule base style express queri applic databas find applic dispar area knowledg mine databas comput aid design manufactur system paper briefli review kei concept deduct databas newli develop enabl technolog describ current research extend function usabl deduct databas provid synthesi deduct databas procedur object orient approach object ident inherit deduct databas evolutionari approach paper propos simpl extens logic base languag deduct databas support kei notion object ident object inherit object orient system paper show logic program minim model construct program minim model basic obtain fr prefix fact uniqu identifi accomplish determinist choic construct altern negat stabl model semant user view fact predic ordinari logic program object refer identifi exten sional databas intension syntact shorthand convent introduc facilit refer base reason access object result logic base languag isa inherit fulli support identifi surrog actual object propos solut firmli root theori deduct databas simpl implement extens current deduct databas system databas transact ldl rule rewrit method implement logic languag ldl optim logic base languag knowledg data intens applic paper describ optim approach ensur safe effici execut applic written ldl declar languag base horn claus logic tend data intens knowledg base applic order gener strategi successfulli relat databas system character optim problem term execut space cost function search algorithm extend framework deal rule complex term recurs problem result richer expr sive power logic termin problem safeti unsaf execu tion treat extrem case poor execut design implement logic base languag data intens applic differenti fixpoint method stratif logic program rewrit rule set term logic data model ldl gener count method recurs logic queri paper treat problem implement effici recurs horn claus queri includ function symbol situat studi initi bind argument recursir queri goal top backward chain execut phase improv effici guarante termin forward chain execut phase implement fixpoint comput recursir queri gener method solv queri method perform analysi bind pass behavior queri reschedul execut fixpoint comput deriv result analysi comput emul propag bind top phase gener desir answer prove goal left unsolv previou step final suffici condit safeti deriv ensur fixpoint comput complet finit number step control optim strategi implement ldl implement recurs queri data languag base pure horn logic magic count method paper studi problem effici implement queri recursir rule function symbol focu import subclass call canon strongli linear queri csl queri studi bind pass properti entail propag initi bind establish constant queri goal top backward chain execu tion phase databas logic forword guest editor overview ldl system paper present overview data mine techniqu context deduct induct cycl model claim made paper combin mode infer model offer adavantag exclus induct deduct introduct model paper describ architectur knowledg miner environ relat ldl deduct databas technolog defin notion meta queri show concept advantag full power deduct data base system paper mention number induct method framework describ data mine experi perform knowledg miner introduct larg collect data serv corpor resourc varieti purpos unknown unspecifi time collect term databas proceed acm sigmod intern confer manag data safeti compil drecurs horn claus rule rewrit method effici implement horn logic gener count method recurs logic queri paper treat problem implement effici recurs horn claus queri includ function symbol situat studi initi bind argument recursir queri goal top backward chain execut phase improv effici guarante termin forward chain execut phase implement fixpoint comput recursir queri gener method solv queri method perform analysi bind pass behavior queri reschedul execut fixpoint comput deriv result analysi comput emul propag bind top phase gener desir answer prove goal left unsolv previou step final suffici condit safeti deriv ensur fixpoint comput complet finit number step implement simpl class logic queri databas paper studi problem effici implement queri recursir rule function symbol focu import subclass call canon strongli linear queri csl queri studi bind pass properti entail propag initi bind establish constant queri goal top backward chain execu tion phase optim nonrecurs queri state art optim approach relat databas system system ob sql ds commerci ingr queri tradit databas applic suffer problem time complex optim algorithm combinator exponenti number relat join queri cost prohibit situa tion deduct databas logic orient languag knowledg base hundr join requir problem tradit approach al beit effect specif domain clear gener scenario parallel evalua tion lack formal model defin assumpt critic factor valicl depend paper ldl logic dbase data languag dmontoon alberta canada waugh william kong salvini chen design squirrel extend sql deduct databas system comput journal vol pp parasay chignel khoshafian wang intellig databas object orient deduct hypermedia technolog york ny wilei son vandereit introduct special issu deduct object orient databas data knowledg engin vol pp octob dibattista lenzerini deduct method er model larg databas proceed fifteenth intern confer amsterdam netherland august palo alto ca pp morgan kauknann van deriet ch han li deduct er deduct entiti relationship data safeti optim horn claus queri issu optim logic base languag represent deduct retriev complex object prolog databas queri languag season object orient databas system knowledg system implement gem support semant data model relat back dend th paper present stmple approach extendmg relatton system ingr rate support semanttc data model describ dbm conststmg user friendli front end supportmg gem semanttc data model queri languag unix tme sharmg system dedtcat back end processor provtdmg efsctent support databas transactton concurr control recoveri gem extend relatton model support notton entttt wtth surrog relattonshtp aggregabon generahzatton null valu set valu attribut provtd stmple extenston quel handl construct tht propos tmplementatton gem relabon databas processor idm bntton lee ts back end machm object dorient program prolog databas relat null valu paper briefli review issu concentr problem gener formal framework relat data model includ null valu basic problem null valu plausibl interpret ansi sparc interim report instanc cite manifest null author agre manifest null reduc basic interpret unknown interpret exist lb nonexist interpret exist databas languag gem design relat view network schema algorithm present design relat view network schema support gener queri updat capabl preserv inform content data base provid independ physic organ propos solut applic exist ccdasyl databas data schema convers declar cddasyl schema suppli sourc logic data definit identifi view design algorithm deriv basi formal analysi semant constraint establish declar form data structur diagram introduc visual constraint intrczaltjctim paper present rigor solut problgn design relat view amp ich support gener weri updat capabl network schema object paramount concern approach inform preserv updat data independ inform preserv need support gener purpos data manipul capabl user capabl access view inform interest author domain view inform wise equival underli schema portion interest problem updat view includ insert delet modifi oper simpl data organ displai view permiss copi fee part materi grant provid copi made distribut direct commerci ad vantag acm copyright notic titl public date notic copi permiss assooia tion comput machineri copi republish requir fee end specif permiss databas relat null valu paper briefli review issu concentr problem gener formal framework relat data model includ null valu basic problem null valu plausibl interpret ansi sparc interim report instanc cite manifest null author agre manifest null reduc basic interpret unknown interpret exist lb nonexist interpret exist formal approach definit design conceptu schemata databas system paper present rigor approach definit design graphic schemata framework relat data model approach appli concept analyt tool present companion paper normal form design relat databas schemata paper address problem databas schema design framework relat data model function depend suggest normal form nf boycecodd normal form bcnf suppli inadequ basi relat schema design main problem nf forgiv enforc separ principl strictli hand bcnf incompat principl represent prone comput complex normal form li captur salient qualiti propos normal form stricter nf compat represent principl simpler definit nf deriv analog definit definit bcnf note analog deriv normal form final prove bernstein algorithm schema design synthes schemata normal form design relat databas schemata paper address problem databas schema design framework relat data model function depend suggest normal form nf boycecodd normal form bcnf suppli inadequ basi relat schema design main problem nf forgiv enforc separ principl strictli hand bcnf incompat principl represent prone comput complex normal form li captur salient qualiti propos normal form stricter nf compat represent principl simpler definit nf deriv analog definit definit bcnf note analog deriv normal form final prove bernstein algorithm schema design synthes schemata normal form mix transit function multivalu depend databas relat paper present rule call mix transit suppli altern simpler complet axiomat combin functio nal multivalu depend databas rela tion decomposit relat synthesi entiti drelationship diagram multimodel extern schema codasyl databas manag system design relat view network schema algorithm present design relat view network schema support gener queri updat capabl preserv inform content data base provid independ physic organ propos solut applic exist ccdasyl databas data schema convers declar cddasyl schema suppli sourc logic data definit identifi view design algorithm deriv basi formal analysi semant constraint establish declar form data structur diagram introduc visual constraint intrczaltjctim paper present rigor solut problgn design relat view amp ich support gener weri updat capabl network schema object paramount concern approach inform preserv updat data independ inform preserv need support gener purpos data manipul capabl user capabl access view inform interest author domain view inform wise equival underli schema portion interest problem updat view includ insert delet modifi oper simpl data organ displai view permiss copi fee part materi grant provid copi made distribut direct commerci ad vantag acm copyright notic titl public date notic copi permiss assooia tion comput machineri copi republish requir fee end specif permiss review acm dsigmod intern confer manag data 